Inductive reasoning and kolmogorov complexity
نویسندگان
چکیده
منابع مشابه
Inductive Reasoning and Komogorov Complexity
This is a sloppy first draft of [J. Comp. System Sciences, 44:2(1992), 343-384]. Also, there are some problems with the pictures and references due to the obsolete troff processing. Reasoning to obtain the ‘truth’ about reality, from external data, is an important, controversial, and complicated issue in man’s effort to understand nature. (Yet, today, we try to make machines do this.) There hav...
متن کاملFinite Inductive Sequences, Kolmogorov Complexity with Application to Genome Sequences
We describe current work in examining the complexity of genomic sequences at the amino acid level. We have provided an original algorithm description and research results when considering this algorithm as a measure of Kolmogorov complexity of such candidate strings. The results can be used to estimate comparative string values, identifying substrings with comparable values, and determining reg...
متن کاملCompressibility and Kolmogorov Complexity
We continue the investigation of the path-connected geometry on the Cantor space and the related notions of dilution and compressibility described in [1]. These ideas are closely related to the notions of effective Hausdorff and packing dimensions of reals, and we argue that this geometry provides the natural context in which to study them. In particular we show that every regular real can be m...
متن کاملKolmogorov complexity and cryptography
We consider (in the framework of algorithmic information theory) questions of the following type: construct a message that contains different amounts of information for recipients that have (or do not have) certain a priori information. Assume, for example, that the recipient knows some string a, and we want to send her some information that allows her to reconstruct some string b (using a). On...
متن کاملKolmogorov Complexity and Games
In this survey we consider some results on Kolmogorov complexity whose proofs are based on interesting games. The close relation between Recursion theory, whose part is Kolmogorov complexity, and Game theory was revealed by Andrey Muchnik. In [10], he associated with every statement φ of Recursion theory a game Gφ that has the following properties. First, Gφ is a game with complete information ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1992
ISSN: 0022-0000
DOI: 10.1016/0022-0000(92)90026-f